On induced subgraphs of trees, with restricted degrees
نویسندگان
چکیده
It is proved that every tree T on n > 2 vertices contains an induced subgraph F such that all its degrees are odd and 1 F 1 >rn/21,
منابع مشابه
Limit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملThe 2-radius and 2-radiian problems on trees
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two non-empty subsets such that the sum of the radii of these two induced subgraphs is minimum. The other is the 2-radiian problem, whose goal is to partition the network into two non-empty subsets such that the sum of the c...
متن کاملGraph reconstruction from subgraphs
The Reconstruction Conjecture asserts that every ÿnite simple undirected graph on 3 or more vertices is determined, up to isomorphism, by its collection of (unlabeled) one-vertex-deleted subgraphs. A more general problem can be investigated if the collection consists of all (unla-beled) subgraphs with a restricted number of vertices. Kelly (Paciÿc J. Math. 7 (1957) 961–968) ÿrst raised the poss...
متن کاملGenerating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
This paper investigates a graph enumeration problem, called the maximal Psubgraphs problem, where P is a hereditary or connected-hereditary graph property. Formally, given a graph G, the maximal P-subgraphs problem is to generate all maximal induced subgraphs of G that satisfy P. This problem differs from the wellknown node-deletion problem, studied by Yannakakis and Lewis [1–3]. In the maximal...
متن کاملA Layer-decomposition with Degree Method for Subgraphs Recognition Problem
For two planar undirected graphs G and H, the subgraphs recognition problem (SRP) is to find and list all subgraphs of G which are isomorphic to H. In this paper, we introduce the idea of layerdecomposition with degree and present an algorithm based on this idea for SRP. Since subgraphs isomorphic to each other contain their spanning trees with the same decomposition, the SRP can be decomposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 125 شماره
صفحات -
تاریخ انتشار 1994